Equational reasoning in Isabelle
نویسندگان
چکیده
منابع مشابه
Modular Reasoning in Isabelle
This work is concerned with modules for higher order logic theorem provers, in particular Isabelle. Modules may be used to represent abstract mathematical structures. This is typical for applications in abstract algebra. In Chapter 1, we set out with the hypothesis that for an adequate representation of abstract structures we need modules that have a representation in the logic. We identify the...
متن کاملModular Reasoning in Isabelle
The concept of locales for Isabelle enables local deenition and assumption for interactive mechanical proofs. Furthermore, dependent types are constructed in Isabelle/HOL for rst class representation of structure. These two concepts are introduced brieey. Although each of them has proved useful in itself, their real power lies in combination. This paper illustrates by examples from abstract alg...
متن کاملEquational Reasoning with Subtypes
Using equational logic as a specification language, we investigate the proof theory of behavioral subtyping for object-oriented abstract data types with immutable objects and deterministic methods that can use multiple dispatch. In particular, we investigate a proof technique for correct behavioral subtyping in which each subtype’s specification includes terms that can be used to coerce its obj...
متن کاملEquational Reasoning for Prolog
Equational Reasoning is a feature of Functional Programming much envied by Logic Programmers. We argue that logic programmers should not shy away from adopting equational reasoning because of perceived pitfalls, but rather embrace it to indulge in its many benefits. We propose and illustrate two approaches: a cumbersome indirection via Haskell and a more insightful approach directly in Prolog.
متن کاملA Methodology for Equational Reasoning
1 This paper presents a methodology to guide equa-tional reasoning in a goal directed way. Suggested by rippling methods developed in the eld of inductive theorem proving we use attributes of terms and heuristics to determine bridge lemmas, i.e. lemmas which have to be used during the proof of the theorem. Once we have found such a bridge lemma we use the techniques of diierence uniication and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1989
ISSN: 0167-6423
DOI: 10.1016/0167-6423(89)90038-5